Interactive function computation via polar coding
نویسندگان
چکیده
منابع مشابه
Distributed Source Coding for Interactive Function Computation
In networked systems where distributed inferencing and control needs to be performed, the raw-data generated at different nodes needs to be transformed and combined in a number of ways to extract actionable information. This requires performing distributed computations on the rawdata. A pure data-transfer solution approach would advocate first reliably reproducing the rawdata at decision-making...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملTwo Terminal Interactive Source Coding for Function Computation With Side Information
We study the problem of two-terminal interactive source coding for function computation with a twosided side information. The sources are discrete memoryless stationary sources taking values in finite sets. We study the settings in which the functions are computed at one or both locations. We derive a computable single-letter characterization of the optimal rate-distortion region and the minimu...
متن کاملDesign and Analysis of Communication Schemes via Polar Coding
Title of dissertation: DESIGN AND ANALYSIS OF COMMUNICATION SCHEMES VIA POLAR CODING Talha Cihad Gulcu Doctor of Philosophy, 2015 Dissertation directed by: Professor Alexander Barg Department of Electrical and Computer Engineering and Institute for System Research Polar codes, introduced by Arıkan in 2009, gave the first solution to the problem of designing explicit coding schemes that attain S...
متن کاملExplicit Polyhedral Bounds on Network Coding Rate Regions via Entropy Function Region: Algorithms, Symmetry, and Computation
The problem of automating rate region converse proofs in multi-source network coding is considered, and an algorithm for explicitly computing polyhedral outer bounds on the rate regions of multi-source network coding instances using known bounds on the entropy function region is proposed. This algorithm is based on the Convex Hull Method, which is an algorithm to compute projections of polyhedr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Problems of Information Transmission
سال: 2016
ISSN: 0032-9460,1608-3253
DOI: 10.1134/s0032946016010063